Prudent walks and polygons

نویسندگان

  • John C. Dethridge
  • Timothy M. Garoni
  • Anthony J. Guttmann
  • Iwan Jensen
چکیده

We have produced extended series for two-dimensional prudent polygons, based on a transfer matrix algorithm of complexity O(n), for a series of length n. We have extended the definition to three dimensions and produced series expansions for both prudent walks and polygons in three dimensions. For prudent polygons in two dimensions we find the growth constant to be smaller than that for the corresponding walks, and by considering three distinct classes of polygons, we find that the growth constant for polygons varies with class, while for walks it does not. We give the critical exponent for both walks and polygons. In the three-dimensional case we estimate the growth constant for both walks and polygons and also estimate the usual critical exponents γ, ν and α. Submitted to: J. Phys. A: Math. Gen. PACS numbers: 05.50.+q,05.70.Jk,02.10.Ox Prudent walks and polygons 2

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The enumeration of prudent polygons by area and its unusual asymptotics

Prudent walks are special self-avoiding walks that never take a step towards an already occupied site, and k-sided prudent walks (with k = 1, 2, 3, 4) are, in essence, only allowed to grow along k directions. Prudent polygons are prudent walks that return to a point adjacent to their starting point. Prudent walks and polygons have been previously enumerated by length and perimeter (Bousquet-Mél...

متن کامل

Exact solution of two classes of prudent polygons

Prudent walks are self-avoiding walks on a lattice which never step into the direction of an already occupied vertex. We study the closed version of these walks, called prudent polygons, where the last vertex of the walk is adjacent to its first one. More precisely, we give the half-perimeter generating functions of two subclasses of prudent polygons on the square lattice, which turn out to be ...

متن کامل

Some New Self-avoiding Walk and Polygon Models

We study the behaviour of prudent, perimeter and quasi-prudent self-avoiding walks and polygons in both two and three dimensions, as well as some solvable subsets. Our analysis combines exact solutions of some simpler cases, careful asymptotic analysis of functional equations which can be obtained in more complicated cases and extensive numerical studies based on exact series expansions for les...

متن کامل

The linking number and the writhe of uniform random walks and polygons in confined spaces

Random walks and polygons are used to model polymers. In this paper we consider the extension of writhe, self-linking number and linking number to open chains. We then study the average writhe, self-linking and linking number of random walks and polygons over the space of configurations as a function of their length. We show that the mean squared linking number, the mean squared writhe and the ...

متن کامل

Prudent Self-Avoiding Walks

We have produced extended series for prudent self-avoiding walks on the square lattice. These are subsets of self-avoiding walks. We conjecture the exact growth constant and critical exponent for the walks, and show that the (anisotropic) generating function is almost certainly not differentiably-finite.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008